- Title
- New largest known graphs of diameter 6
- Creator
- Pineda-Villavicencio, Guillermo; Gómez, José; Miller, Mirka; Pérez-Rosés, Hebert
- Relation
- Networks Vol. 53, Issue 4, p. 315-328
- Publisher Link
- http://dx.doi.org/10.1002/net.20269
- Publisher
- John Wiley & Sons
- Resource Type
- journal article
- Date
- 2009
- Description
- In the pursuit of obtaining largest graphs of given maximum degree Δ and diameter D, many construction techniques have been developed. Compounding of graphs is one such technique. In this article, by means of the compounding of complete graphs into a bipartite Moore graph of diameter 6, we obtain a family of large graphs of the same diameter. For maximum degrees Δ = 5, 6, 9, 12, and 14, members of this family constitute the largest known graphs of diameter 6.
- Subject
- degree/diameter problem; bipartite Moore graphs; compounding of graphs
- Identifier
- uon:7792
- Identifier
- http://hdl.handle.net/1959.13/808952
- Identifier
- ISSN:0028-3045
- Reviewed
- Hits: 2583
- Visitors: 1858
- Downloads: 0
| Thumbnail | File | Description | Size | Format |
|---|